Multi-terminal multipath flows: synthesis*1
نویسندگان
چکیده
منابع مشابه
Imidoester Inhibition of LymphocyteDNA Synthesis1
The bifunctional imidoester DMA3 and the monofunc tional imidoester MAC were obtained from Pierce Chemical Company (Rockford, Ill.). MAC was more than 96% pure, and DMA was more than 99% pure by physicochemical analyses. The erythroagglutinating lectin of E-PHA was purified from bactophytohemagglutinin-P (Difco Laborato ries, Detroit, Mich.) by the method of Weber et a!. (9) to apparent homogen...
متن کاملCongestion Minimization for Multipath Routing via Multiroute Flows
Congestion minimization is a well-known routing problem for which there is an O(logn/ log logn)approximation via randomized rounding [17]. Srinivasan [18] formally introduced the low-congestion multi-path routing problem as a generalization of the (single-path) congestion minimization problem. The goal is to route multiple disjoint paths for each pair, for the sake of fault tolerance. Srinivasa...
متن کاملEnd-to-end performance guarantees for multipath flows
When routing data across a network from one source to one destination, instead of following a fixed path, one can choose to spread data on several routes in order to use all potential ressources of the network. This issue has been studied for many models of networks with various objectives to optimize. In this paper we investigate how to route a flow across a network of servers with end-to-end ...
متن کاملDistributed Algorithms for Optimal Rate Allocation of Multipath Traffic Flows
We address the question of optimal rate allocation for multipath unicast traffic, with theobjective of maximizing the total system utility. First, we consider the problem where the setof paths (routes) between each flow is predetermined, and show how the optimal rates on thesepaths can be computed. We then consider the problem where the paths are not predetermined,and present an...
متن کاملFormal Verification By Reverse Synthesis1
In this paper we describe a novel yet practical approach to the formal verification of implementations. Our approach splits verification into two major parts. The first part verifies an implementation against a low-level specification written using source-code annotations. The second extracts a high-level specification from the implementation with the low-level specification, and proves that it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(04)00129-5